Lower Space Bounds for Accepting Shuffle Languages

Lower space bounds for accepting shuffle languages

In [6] it was shown that shuffle languages are contained in one-way-NSPACE(log n) and in P. In this paper we show that nondeterministic one-way logarithmic space is in some sense the lower bound for accepting shuffle languages. Namely, we show that there exists a shuffle language which is not accepted by any deterministic one-way Turing machine with space bounded by a sublinear function, and th...

Some Lower Bounds for Estrada Index

Conditional Lower Bounds for Space/Time Tradeoffs

In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P. A ...

Lower Space Bounds for Randomized Computation

It is a fundamental open problem in the randomized computation how to separate diierent randomized time or randomized small space classes (cf., e.g., KV 87], KV 88]). In this paper we study lower space bounds for randomized computation, and prove lower space bounds up to log n for the speciic sets computed by the Monte Carlo Turing machines. This enables us for the rst time, to separate randomi...

Lower Bounds for Alternating Online Space Complexity

The notion of online space complexity, introduced by Karp in 1967, quantifies the amount of space required to solve a given problem using an online algorithm, represented by a Turing machine which scans the input exactly once from left to right. In this paper, we study alternating algorithms as introduced by Chandra, Kozen and Stockmeyer in 1976. We devise a lower bound technique relying on bou...